Rank-Constrained Schur-Convex Optimization With Multiple Trace/Log-Det Constraints
نویسندگان
چکیده
منابع مشابه
Low-rank optimization with convex constraints
The problem of low-rank approximation with convex constraints, which often appears in data analysis, image compression and model order reduction, is considered. Given a data matrix, the objective is to find an approximation of desired lower rank that fulfills the convex constraints and minimizes the distance to the data matrix in the Frobenius-norm. The problem of matrix completion can be seen ...
متن کاملDistributed Convex Optimization with Many Convex Constraints
We address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot of attention in the Big Data context. Although it has been invented decades ago, ADMM so far can be applied only to unconstrained problems and problems with...
متن کاملReliability optimization problems with multiple constraints under fuzziness
In reliability optimization problems diverse situation occurs due to which it is not always possible to get relevant precision in system reliability. The imprecision in data can often be represented by triangular fuzzy numbers. In this manuscript, we have considered different fuzzy environment for reliability optimization problem of redundancy. We formulate a redundancy allocation problem for a...
متن کاملOnline Convex Optimization with Stochastic Constraints
This paper considers online convex optimization (OCO) with stochastic constraints, which generalizes Zinkevich’s OCO over a known simple fixed set by introducing multiple stochastic functional constraints that are i.i.d. generated at each round and are disclosed to the decision maker only after the decision is made. This formulation arises naturally when decisions are restricted by stochastic e...
متن کاملTwo-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints
This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints. Firstly, we consider some lower level constraint qualifications (CQs) for this problem. Then, under these CQs, we derive formula for estimating the subdifferential of its valued function. Finally, we present some necessary optimality condit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2011
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2010.2084997